Diamond-free Degree Sequences
نویسندگان
چکیده
While attempting to classify partial linear spaces produced during the execution of an extension of Stinson’s hill-climbing algorithm a new problem arises, that of generating all graphical degree sequences that are diamond-free (i.e. have no diamond as subgraph) and satisfy additional constraints. We formalize this new problem, propose a constraint programming solution and list all satisfying degree sequences of length 8 to 16 inclusive.
منابع مشابه
Clique Separator Decomposition of Hole- and Diamond-Free Graphs and Algorithmic Consequences
Clique separator decomposition introduced by Tarjan and Whitesides is one of the most important graph decompositions. A graph is an atom if it has no clique separator. A hole is a chordless cycle with at least five vertices, and an antihole is the complement graph of a hole. A graph is weakly chordal if it is holeand antihole-free. K4−e is also called diamond. Paraglider has five vertices four ...
متن کاملSpongy Diamond
Rhombellanes are mathematical structures existing in various environments, in crystal or quasicrystal networks, or even in their homeomorphs, further possible becoming real molecules. Rhombellanes originate in the K2.3 complete bipartite graph, a tile found in the linear polymeric staffanes. In close analogy, a rod-like polymer derived from hexahydroxy-cyclohexane was imagined. Further, the ide...
متن کاملEven-hole-free graphs that do not contain diamonds: A structure theorem and its consequences
In this paper we consider the class of simple graphs defined by excluding, as induced subgraphs, even holes (i.e., chordless cycles of even length) and diamonds (i.e., a graph obtained from a clique of size 4 by removing an edge). We say that such graphs are (evenhole, diamond)-free. For this class of graphs we first obtain a decomposition theorem, using clique cutsets, bisimplicial cutsets (wh...
متن کاملOn the connectivity of p-diamond-free graphs
Let G be a graph of order n(G), minimum degree (G) and connectivity (G). Chartrand and Harary [Graphs with prescribed connectivities, in: P. Erdös, G. Katona (Eds.), Theory of Graphs, Academic Press, NewYork, 1968, pp. 61–63] gave the following lower bound on the connectivity (G) 2 (G)+ 2− n(G). Topp and Volkmann [Sufficient conditions for equality of connectivity and minimum degree of a graph,...
متن کاملA Nonlow2 C.e. Degree Which Bounds No Diamond Bases
A computably enumerable (c.e.) Turing degree is a diamond base if and only if it is the bottom of a diamond of c.e. degrees with top 0′. Cooper and Li [3] showed that no low2 c.e. degree can bound a diamond bases. In the present paper, we show that there exists a nonlow2 c.e. degree which does not bound a diamond base. Thus, we refute an attractive natural attempt to define the jump class low2.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1208.0460 شماره
صفحات -
تاریخ انتشار 2012